Random Planar Structures and Random Graph Processes
نویسنده
چکیده
منابع مشابه
Daniel Johannsen: Random Combinatorial Structures and Randomized Algorithms
This thesis is concerned with the probabilistic analysis of random combinatorial structures and the runtime analysis of randomized search heuristics. On the subject of random structures, we investigate two classes of combinatorial objects. The first is the class of planar maps and the second is the class of generalized parking functions. We identify typical properties of these structures and sh...
متن کاملScaling of Percolation on Infinite Planar Maps, I
We consider several aspects of the scaling limit of percolation on random planar triangulations, both finite and infinite. The equivalents for random maps of Cardy’s formula for the limit under scaling of various crossing probabilities are given. The limit probabilities are expressed in terms of simple events regarding Airy-Lévy processes. Some explicit formulas for limit probabilities follow f...
متن کاملStochastic Geometry and Random Tessellations
Random tessellations form a very important field in stochastic geometry. They pose many interesting mathematical problems and have numerous important applications in many branches of natural sciences and engineering, as this volume shows. This contribution aims to present mathematical basic facts as well as statistical ideas for random tessellations of the d-dimensional Euclidean space R. Havin...
متن کاملThe random planar graph process
We consider the following variant of the classical random graph process introduced by Erdős and Rényi. Starting with an empty graph on n vertices, choose the next edge uniformly at random among all edges not yet considered, but only insert it if the graph remains planar. We show that for all ε > 0, with high probability, θ(n) edges have to be tested before the number of edges in the graph reach...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کامل